Termination w.r.t. Q proof of TRS/TRCSREx4_7_37_Bor03

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> ZWQUOT₂(XS, YS)
PROPER₁(minus₂(X1, X2)) -> MINUS₂(proper₁(X1), proper₁(X2))
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> QUOT₂(X, Y)
MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> QUOT₂(proper₁(X1), proper₁(X2))
PROPER₁(zWquot₂(X1, X2)) -> ZWQUOT₂(proper₁(X1), proper₁(X2))
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(minus₂(X1, X2)) -> MINUS₂(X1, active₁(X2))
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> S₁(quot₂(minus₂(X, Y), s₁(Y)))
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> QUOT₂(minus₂(X, Y), s₁(Y))
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
ACTIVE₁(quot₂(X1, X2)) -> QUOT₂(X1, active₁(X2))
ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
ZWQUOT₂(ok₁(X1), ok₁(X2)) -> ZWQUOT₂(X1, X2)
QUOT₂(ok₁(X1), ok₁(X2)) -> QUOT₂(X1, X2)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)
TOP₁(mark₁(X)) -> PROPER₁(X)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)
QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> QUOT₂(active₁(X1), X2)
PROPER₁(sel₂(X1, X2)) -> SEL₂(proper₁(X1), proper₁(X2))
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(X1, active₁(X2))
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> MINUS₂(X, Y)
ACTIVE₁(minus₂(X1, X2)) -> MINUS₂(active₁(X1), X2)
ACTIVE₁(sel₂(s₁(N), cons₂(X, XS))) -> SEL₂(N, XS)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
MINUS₂(X1, mark₁(X2)) -> MINUS₂(X1, X2)
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ZWQUOT₂(active₁(X1), X2)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> CONS₂(quot₂(X, Y), zWquot₂(XS, YS))
ACTIVE₁(zWquot₂(X1, X2)) -> ZWQUOT₂(X1, active₁(X2))
ACTIVE₁(from₁(X)) -> S₁(X)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
ACTIVE₁(minus₂(s₁(X), s₁(Y))) -> MINUS₂(X, Y)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(active₁(X1), X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> FROM₁(s₁(X))
PROPER₁(from₁(X)) -> FROM₁(proper₁(X))
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> ZWQUOT₂(XS, YS)
PROPER₁(minus₂(X1, X2)) -> MINUS₂(proper₁(X1), proper₁(X2))
ACTIVE₁(from₁(X)) -> FROM₁(active₁(X))
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> QUOT₂(X, Y)
MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)
S₁(mark₁(X)) -> S₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> QUOT₂(proper₁(X1), proper₁(X2))
PROPER₁(zWquot₂(X1, X2)) -> ZWQUOT₂(proper₁(X1), proper₁(X2))
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(minus₂(X1, X2)) -> MINUS₂(X1, active₁(X2))
FROM₁(mark₁(X)) -> FROM₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> S₁(quot₂(minus₂(X, Y), s₁(Y)))
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> QUOT₂(minus₂(X, Y), s₁(Y))
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(s₁(X)) -> S₁(active₁(X))
ACTIVE₁(quot₂(X1, X2)) -> QUOT₂(X1, active₁(X2))
ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
ZWQUOT₂(ok₁(X1), ok₁(X2)) -> ZWQUOT₂(X1, X2)
QUOT₂(ok₁(X1), ok₁(X2)) -> QUOT₂(X1, X2)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)
TOP₁(mark₁(X)) -> PROPER₁(X)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)
QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> QUOT₂(active₁(X1), X2)
PROPER₁(sel₂(X1, X2)) -> SEL₂(proper₁(X1), proper₁(X2))
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(X1, active₁(X2))
ACTIVE₁(quot₂(s₁(X), s₁(Y))) -> MINUS₂(X, Y)
ACTIVE₁(minus₂(X1, X2)) -> MINUS₂(active₁(X1), X2)
ACTIVE₁(sel₂(s₁(N), cons₂(X, XS))) -> SEL₂(N, XS)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
PROPER₁(s₁(X)) -> S₁(proper₁(X))
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
S₁(ok₁(X)) -> S₁(X)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
MINUS₂(X1, mark₁(X2)) -> MINUS₂(X1, X2)
ACTIVE₁(from₁(X)) -> CONS₂(X, from₁(s₁(X)))
CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
ACTIVE₁(cons₂(X1, X2)) -> CONS₂(active₁(X1), X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ZWQUOT₂(active₁(X1), X2)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
ACTIVE₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> CONS₂(quot₂(X, Y), zWquot₂(XS, YS))
ACTIVE₁(zWquot₂(X1, X2)) -> ZWQUOT₂(X1, active₁(X2))
ACTIVE₁(from₁(X)) -> S₁(X)
PROPER₁(cons₂(X1, X2)) -> CONS₂(proper₁(X1), proper₁(X2))
ACTIVE₁(minus₂(s₁(X), s₁(Y))) -> MINUS₂(X, Y)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(from₁(X)) -> PROPER₁(X)
ACTIVE₁(sel₂(X1, X2)) -> SEL₂(active₁(X1), X2)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 10 SCCs with 31 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)
ZWQUOT₂(ok₁(X1), ok₁(X2)) -> ZWQUOT₂(X1, X2)
ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ZWQUOT₂(ok₁(X1), ok₁(X2)) -> ZWQUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)
ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(ZWQUOT₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 2·x₁
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)
ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ZWQUOT₂(mark₁(X1), X2) -> ZWQUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(ZWQUOT₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ZWQUOT₂(X1, mark₁(X2)) -> ZWQUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(ZWQUOT₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)
QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)
QUOT₂(ok₁(X1), ok₁(X2)) -> QUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOT₂(ok₁(X1), ok₁(X2)) -> QUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.

QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)
QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(QUOT₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 2·x₁
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)
QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOT₂(mark₁(X1), X2) -> QUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.

QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(QUOT₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOT₂(X1, mark₁(X2)) -> QUOT₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(QUOT₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)
MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)
MINUS₂(X1, mark₁(X2)) -> MINUS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

MINUS₂(X1, mark₁(X2)) -> MINUS₂(X1, X2)

The remaining pairs can at least be oriented weakly.

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)
MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(MINUS₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 2 + 2·x₁
POL(ok₁(x₁)) = 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)
MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

MINUS₂(ok₁(X1), ok₁(X2)) -> MINUS₂(X1, X2)

The remaining pairs can at least be oriented weakly.

MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(MINUS₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 0
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

MINUS₂(mark₁(X1), X2) -> MINUS₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(MINUS₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(ok₁(X1), ok₁(X2)) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(SEL₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 2·x₁
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)
SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(mark₁(X1), X2) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(SEL₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

SEL₂(X1, mark₁(X2)) -> SEL₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(SEL₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)
S₁(mark₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(mark₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.

S₁(ok₁(X)) -> S₁(X)

Used ordering: Polynomial interpretation [21]:

POL(S₁(x₁)) = 2·x₁
POL(mark₁(x₁)) = 2 + 2·x₁
POL(ok₁(x₁)) = 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S₁(ok₁(X)) -> S₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S₁(ok₁(X)) -> S₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(S₁(x₁)) = 2·x₁
POL(ok₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)
CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(ok₁(X1), ok₁(X2)) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

Used ordering: Polynomial interpretation [21]:

POL(CONS₂(x₁, x₂)) = 2·x₂
POL(mark₁(x₁)) = 0
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS₂(mark₁(X1), X2) -> CONS₂(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(CONS₂(x₁, x₂)) = 2·x₁
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(mark₁(X)) -> FROM₁(X)
FROM₁(ok₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM₁(ok₁(X)) -> FROM₁(X)

The remaining pairs can at least be oriented weakly.

FROM₁(mark₁(X)) -> FROM₁(X)

Used ordering: Polynomial interpretation [21]:

POL(FROM₁(x₁)) = 2·x₁
POL(mark₁(x₁)) = 2·x₁
POL(ok₁(x₁)) = 2 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM₁(mark₁(X)) -> FROM₁(X)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM₁(mark₁(X)) -> FROM₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(FROM₁(x₁)) = 2·x₁
POL(mark₁(x₁)) = 1 + 2·x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(cons₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(cons₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(from₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s₁(x₁)) = 2·x₁
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(sel₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(sel₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(from₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s₁(x₁)) = 2·x₁
POL(sel₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(from₁(X)) -> PROPER₁(X)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(from₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(from₁(x₁)) = 2 + 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s₁(x₁)) = 2·x₁
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(s₁(X)) -> PROPER₁(X)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(s₁(X)) -> PROPER₁(X)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s₁(x₁)) = 2 + 2·x₁
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(zWquot₂(X1, X2)) -> PROPER₁(X1)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(minus₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(minus₂(X1, X2)) -> PROPER₁(X1)

The remaining pairs can at least be oriented weakly.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER₁(quot₂(X1, X2)) -> PROPER₁(X1)
PROPER₁(quot₂(X1, X2)) -> PROPER₁(X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(PROPER₁(x₁)) = 2·x₁
POL(quot₂(x₁, x₂)) = 1 + 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(s₁(X)) -> ACTIVE₁(X)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(s₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2·x₁
POL(from₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s₁(x₁)) = 2 + 2·x₁
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(minus₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2·x₁
POL(from₁(x₁)) = 2·x₁
POL(minus₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(from₁(X)) -> ACTIVE₁(X)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(from₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2·x₁
POL(from₁(x₁)) = 2 + 2·x₁
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(zWquot₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2·x₁
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(zWquot₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(cons₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(cons₂(x₁, x₂)) = 2 + 2·x₁
POL(quot₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X1)
ACTIVE₁(quot₂(X1, X2)) -> ACTIVE₁(X2)

The remaining pairs can at least be oriented weakly.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)

Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(quot₂(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(sel₂(x₁, x₂)) = 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X2)
ACTIVE₁(sel₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(ACTIVE₁(x₁)) = 2·x₁
POL(sel₂(x₁, x₂)) = 1 + 2·x₁ + 2·x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(from₁(X)) -> mark₁(cons₂(X, from₁(s₁(X))))
active₁(sel₂(0, cons₂(X, XS))) -> mark₁(X)
active₁(sel₂(s₁(N), cons₂(X, XS))) -> mark₁(sel₂(N, XS))
active₁(minus₂(X, 0)) -> mark₁(0)
active₁(minus₂(s₁(X), s₁(Y))) -> mark₁(minus₂(X, Y))
active₁(quot₂(0, s₁(Y))) -> mark₁(0)
active₁(quot₂(s₁(X), s₁(Y))) -> mark₁(s₁(quot₂(minus₂(X, Y), s₁(Y))))
active₁(zWquot₂(XS, nil)) -> mark₁(nil)
active₁(zWquot₂(nil, XS)) -> mark₁(nil)
active₁(zWquot₂(cons₂(X, XS), cons₂(Y, YS))) -> mark₁(cons₂(quot₂(X, Y), zWquot₂(XS, YS)))
active₁(from₁(X)) -> from₁(active₁(X))
active₁(cons₂(X1, X2)) -> cons₂(active₁(X1), X2)
active₁(s₁(X)) -> s₁(active₁(X))
active₁(sel₂(X1, X2)) -> sel₂(active₁(X1), X2)
active₁(sel₂(X1, X2)) -> sel₂(X1, active₁(X2))
active₁(minus₂(X1, X2)) -> minus₂(active₁(X1), X2)
active₁(minus₂(X1, X2)) -> minus₂(X1, active₁(X2))
active₁(quot₂(X1, X2)) -> quot₂(active₁(X1), X2)
active₁(quot₂(X1, X2)) -> quot₂(X1, active₁(X2))
active₁(zWquot₂(X1, X2)) -> zWquot₂(active₁(X1), X2)
active₁(zWquot₂(X1, X2)) -> zWquot₂(X1, active₁(X2))
from₁(mark₁(X)) -> mark₁(from₁(X))
cons₂(mark₁(X1), X2) -> mark₁(cons₂(X1, X2))
s₁(mark₁(X)) -> mark₁(s₁(X))
sel₂(mark₁(X1), X2) -> mark₁(sel₂(X1, X2))
sel₂(X1, mark₁(X2)) -> mark₁(sel₂(X1, X2))
minus₂(mark₁(X1), X2) -> mark₁(minus₂(X1, X2))
minus₂(X1, mark₁(X2)) -> mark₁(minus₂(X1, X2))
quot₂(mark₁(X1), X2) -> mark₁(quot₂(X1, X2))
quot₂(X1, mark₁(X2)) -> mark₁(quot₂(X1, X2))
zWquot₂(mark₁(X1), X2) -> mark₁(zWquot₂(X1, X2))
zWquot₂(X1, mark₁(X2)) -> mark₁(zWquot₂(X1, X2))
proper₁(from₁(X)) -> from₁(proper₁(X))
proper₁(cons₂(X1, X2)) -> cons₂(proper₁(X1), proper₁(X2))
proper₁(s₁(X)) -> s₁(proper₁(X))
proper₁(sel₂(X1, X2)) -> sel₂(proper₁(X1), proper₁(X2))
proper₁(0) -> ok₁(0)
proper₁(minus₂(X1, X2)) -> minus₂(proper₁(X1), proper₁(X2))
proper₁(quot₂(X1, X2)) -> quot₂(proper₁(X1), proper₁(X2))
proper₁(zWquot₂(X1, X2)) -> zWquot₂(proper₁(X1), proper₁(X2))
proper₁(nil) -> ok₁(nil)
from₁(ok₁(X)) -> ok₁(from₁(X))
cons₂(ok₁(X1), ok₁(X2)) -> ok₁(cons₂(X1, X2))
s₁(ok₁(X)) -> ok₁(s₁(X))
sel₂(ok₁(X1), ok₁(X2)) -> ok₁(sel₂(X1, X2))
minus₂(ok₁(X1), ok₁(X2)) -> ok₁(minus₂(X1, X2))
quot₂(ok₁(X1), ok₁(X2)) -> ok₁(quot₂(X1, X2))
zWquot₂(ok₁(X1), ok₁(X2)) -> ok₁(zWquot₂(X1, X2))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.